Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("FAST FOURIER TRANSFORMATION")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 3443

  • Page / 138
Export

Selection :

  • and

MODALANALYSE - EIN NEUARTIGES UND EFFEKTIVES HILFSMITTEL ZUR DARSTELLUNG DES DYNAMISCHEN MASCHINENVERHALTENS. = ANALYSE MODALE: UNE METHODE NOUVELLE ET EFFICACE POUR REPRESENTER LE COMPORTEMENT DYNAMIQUE D'UNE MACHINEPROSSLER EK.1976; ANZ.; DTSCH.; DA. 1976; VOL. 98; NO 42; PP. 719-722; BIBL. 5 REF.Article

A METHOD TO INCREASE THE ACCURACY OF FAST FOURIER TRANSFORM CALCULATIONS FOR RAPIDLY VARYING FUNCTIONSBALCOU Y.1981; IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT; ISSN 0018-9456; USA; DA. 1981; VOL. 30; NO 1; PP. 38-40; BIBL. 6 REF.Article

SEMI-FAST FOURIER TRANSFORMS OVER (GF(2M)SARWATE DV.1978; P.E.E.E. TRANS. COMPUTERS; USA; DA. 1978; VOL. 27; NO 3; PP. 283-285; BIBL. 11 REF.Article

EFFICIENT FAST FOURIER TRANSFORM PROGRAMS FOR ARBITRARY FACTORS WITH ONE STEP LOOP UNSCRAMBLING.POLGE RJ; BHAGAVAN BK.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 5; PP. 534-539; BIBL. 6 REF.Article

COMPUTING THE WAITING TIME DISTRIBUTION FOR THE G/G/1 QUEUE BY SIGNAL PROCESSING METHODSACKROYD MH.1980; I.E.E.E. TRANS. COMMUNIC.; USA; DA. 1980; VOL. 28; NO 1; PP. 52-58; BIBL. 15 REF.Article

FAST DIGITAL FREQUENCY RESPONSE MEASUREMENT WITH MULTIFREQUENCY SIGNALSVARY P.1980; ARCH. ELEKTRON. UEBERTRAG.-TECH.; DEU; DA. 1980; VOL. 34; NO 5; PP. 190-195; ABS. GER; BIBL. 17 REF.Article

FAST-FOURIER-TRANSFORM HOLOGRAPHY: RECENT RESULTS.HUTTON G.1978; OPT. LETTERS; USA; DA. 1978; VOL. 3; NO 1; PP. 30-32; BIBL. 8 REF.Article

FLEXIBILITY IN THE LENGTH OF CONVOLUTIONS COMPUTED USING FOURIER-LIKE FAST TRANSFORM ALGORITHMSARAMBEPOLA B; RAYNER PJW.1980; SIGNAL PROCESS; NLD; DA. 1980; VOL. 2; NO 1; PP. 31-38; ABS. GER/FRE; BIBL. 14 REF.Article

MAXIMUM ENTROPY METHOD AND FAST FOURIER ANALYSIS OF SHORT TIME SERIESPLOMEROVA J; FUCIK P.1976; GEOFYS. SBOR.; CSK; DA. 1976 PUBL. 1978; VOL. 24; PP. 195-210; BIBL. 9 REF.Article

ALGEBRAIC FORMULATION OF THE FAST FOURIER TRANSFORMTRAN THONG.1981; IEEE CIRCUITS SYST. MAG.; ISSN 0163-6812; USA; DA. 1981; VOL. 3; NO 2; PP. 9-19; BIBL. 19 REF.Article

THE SOLUTION BY FAST FOURIER TRANSFORMS OF LAPLACE'S EQUATION IN A TOROIDAL REGION WITH A RECTANGULAR CROSS-SECTIONCAMPBELL JB.1980; J. COMPUT. APPL. MATH.; BEL; DA. 1980; VOL. 6; NO 2; PP. 89-92; BIBL. 12 REF.Article

NOUVEL ALGORITHME DE TRANSFORMATION DE FOURIER RAPIDEKAPORIN IE.1980; ZH. VYCHISLIST. MAT. MAT. FIZ.; SUN; DA. 1980; VOL. 20; NO 4; PP. 1054-1058; BIBL. 3 REF.Article

COMPUTING THE FAST FOURIER TRANSFORM ON A VECTOR COMPUTERKORN DG; LAMBIOTTE JJ JR.1979; MATH. OF COMPUT.; USA; DA. 1979; VOL. 33; NO 147; PP. 977-992; BIBL. 5 REF.Article

FAST FOURIER TRANSFORMSSCHIRM L.1979; NEW ELECTRON.; GBR; DA. 1979; VOL. 12; NO 2; PP. 20-28; (5 P.)Article

FFT LENGTH IN DIGITAL FILTERINGBUTZ AR.1979; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1979; VOL. 28; NO 8; PP. 577-580; BIBL. 9 REF.Article

INTERACTION BY FAST FOURIER AND CHEBYSHEV TRANSFORMSMONRO DM.1979; INTERNATION. J. NUMER. METHODS ENGNG; GBR; DA. 1979; VOL. 14; NO 11; PP. 1679-1692; BIBL. 10 REF.Article

A DIRECT TWO-DIMENSIONAL FFT WITH APPLICATIONS IN IMAGE PROCESSINGNACCARATO DF; CHIEN YT.1979; PATTERN RECOGNITION AND IMAGE PROCESSING. INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS COMPUTER SOCIETY. CONFERENCE ON PATTERN RECOGNITION AND IMAGE PROCESSING/1979/CHICAGO IL; USA; NEW YORK: IEEE; DA. 1979; PP. 233-238; BIBL. 9 REF.Conference Paper

A NOVEL APPROACH TO DFT AND FFT COEFFICIENT ERROR ANALYSISHEUTE U.1979; ARCH. ELEKTRON. UBERTRAG.-TECH.; DEU; DA. 1979; VOL. 33; NO 1; PP. 20-22; ABS. GER; BIBL. 9 REF.Article

DISCRETE FOURIER TRANSFORM COMPUTATION VIA THE WALSH TRANSFORMTADOKORO Y; HIGUCHI T.1978; I.E.E.E. TRANS. ACOUST. SPEECH SIGNAL PROCESSG; USA; DA. 1978; VOL. 26; NO 3; PP. 236-240; BIBL. 9 REF.Article

FAST ALGORITHM FOR COMPUTING COMPLEX NUMBER-THEORETIC TRANSFORMS.REED IS; LIU KY; TRUONG TK et al.1977; ELECTRON. LETTERS; G.B.; DA. 1977; VOL. 13; NO 10; PP. 278-280; BIBL. 15 REF.Article

FAST FOURIER TRANSFORM SYSTEM USING AN M.P.U.RIVERS LATHAM P.1977; NEW ELECTRON.; G.B.; DA. 1977; VOL. 10; NO 18; PP. 112-117 (3P.)Article

PERFORMANCE COMPARISON OF DATA WINDOWS.PRABHU KMM; REDDY VU; AGRAWAL JP et al.1977; ELECTRON. LETTERS; G.B.; DA. 1977; VOL. 13; NO 20; PP. 600-601; BIBL. 6 REF.Article

THE DIGITAL SIGNAL PROCESSOR INDUSTRY. ITS PAST PERFORMANCE, PRESENT STATUS AND FUTURE PROSPECTS.CHAO JT.1977; IN: INT. CONF. ACOUST. SPEECH SIGNAL PROCESS.; HARTFORD, CONN.; 1977; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1977; PP. 487-489; BIBL. 10 REF.Conference Paper

A NEW ALGORITHM FOR COMPUTING THE DISCRETE FOURIER TRANSFORM.WINOGRAD S.1977; IN: ANNU ASILOMAR CONF. CIRCUITS, SYST., COMPUT. 10; PACIFIC GROVE, CALIF.; 1976; NORTH HOLLYWOOD, CALIF.; WESTERN PERIODICALS; DA. 1977; PP. 1-3; BIBL. 2 REF.Conference Paper

DISCRETE HILBERT TRANSFORM FILTERING.SABRI MS; STEENAART W.1976; IN: INT. CONF. ACOUST. SPEECH SIGNAL PROCESS. CONF. REC.; PHILADELPHIA, PA.; 1976; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1976; PP. 116-119; BIBL. 15 REF.Conference Paper

  • Page / 138